Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts
نویسندگان
چکیده
منابع مشابه
Tight Euler tours in uniform hypergraphs - computational aspects
By a tight tour in a k-uniform hypergraph H we mean any sequence of its vertices (w0, w1, . . . , ws−1) such that for all i = 0, . . . , s−1 the set ei = {wi, wi+1 . . . , wi+k−1} is an edge ofH (where operations on indices are computed modulo s) and the sets ei for i = 0, . . . , s − 1 are pairwise different. A tight tour in H is a tight Euler tour if it contains all edges ofH . We prove that ...
متن کاملSpanning trees, Euler tours, medial graphs, left-right paths and cycle spaces
Let G = (V, E) be a graph embedded in a surface 2. (Unless otherwise specifically stated, all graphs and surfaces are assumed to be connected and all embeddings are cellular, i.e. every face is homeomorphic to an open disc.) The geometric dual of G is the graph Go = (D, E), where D is the set of faces of G and an edge e E E joins the two faces (not necessarily different) that lie on either side...
متن کاملMatching, Euler tours and the Chinese postman
The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as a linear programming polyhedron. This polyhedron is used to show that a good algorithm gives an optimum solution. The algorithm is a specialization of the more general b-matching blossom algorithm. Algorithms for finding Euler tours and related problems are also discu...
متن کاملFinding Euler Tours in the StrSort Model
We present a first algorithm for finding Euler tours in undirected graphs in the StrSort model. This model is a relaxation of the semi streaming model. The graph is given as a stream of its edges and can only be read sequentially, but while doing a pass over the stream we are allowed to write out another stream which will be the input for the next pass. In addition, items in the stream are sort...
متن کاملEmbedding spanning structures in graphs and hypergraphs
In this thesis we prove three main results on embeddings of spanning subgraphs into graphs and hypergraphs. The first is that for log n/n 6 p 6 1−n−1/4 log n, a binomial random graph G ∼ Gn,p contains with high probability a collection of bδ(G)/2c edgedisjoint Hamilton cycles (plus an additional edge-disjoint matching if δ(G) is odd), which confirms for this range of p a conjecture of Frieze an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2018.06.021